Reconstructing trees from digitally convex sets
نویسندگان
چکیده
منابع مشابه
Generating and Enumerating Digitally Convex Sets of Trees
Suppose V is a finite set and C a collection of subsets of V that contains ∅ and V and is closed under taking intersections. Then C is called a convexity and the ordered pair (V, C) is called an aligned space and the elements of C are referred to as convex sets. For a set S ⊆ V , the convex hull of S relative to C, denoted by CHC(S), is the smallest convex set containing S. A set S of vertices ...
متن کاملReconstructing Convex Sets from Support Line Measurements
Abstruct-This paper proposes algorithms for reconstructing convex sets given noisy support line measurements. We begin by observing that a set of measured support lines may not be consistent with any set in the plane. We then develop a theory of consistent support lines which serves as a basis for reconstruction algorithms that take the form of constrained optimization algorithms. The formal st...
متن کاملReconstructing Convex Sets from Support Line Measurements
This paper proposes algorithms for reconstructing convex sets given noisy support line measurements. We begin by observing that a set of measured support lines may not be consistent with any set in the plane. We then develop a theory of consistent support lines which serves as a basis for reconstruction algorithms that take the form of constrained optimization algorithms. The formal statement o...
متن کاملAn algorithm reconstructing convex lattice sets
In this paper, we study the problem of reconstructing special lattice sets from X-rays in a finite set of prescribed directions. We present the class of “Q-convex” sets which is a new class of subsets of Z2 having a certain kind of weak connectedness. The main result of this paper is a polynomial-time algorithm solving the reconstruction problem for the “Q-convex” sets. These sets are uniquely ...
متن کاملLyndon + Christoffel = digitally convex
Discrete geometry redefines notions borrowed from Euclidean geometry creating a need for new algorithmical tools. The notion of convexity does not translate trivially, and detecting if a discrete region of the plane is convex requires a deeper analysis. To the many different approaches of digital convexity, we propose the combinatorics on words point of view, unnoticed until recently in the pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.08.018